Gene expression To permute or not to permute
نویسندگان
چکیده
Permutation test is a popular technique for testing a hypothesis of no effect, when the distribution of the test statistic is unknown. To test the equality of two means, a permutation test might use a test statistic which is the difference of the two sample means in the univariate case. In the multivariate case, it might use a test statistic which is the maximum of the univariate test statistics. A permutation test then estimates the null distribution of the test statistic by permuting the observations between the two samples. We will show that, for such tests, if the two distributions are not identical (as for example when they have unequal variances, correlations or skewness), then a permutation test for equality ofmeans based on difference of sample means can have an inflated Type I error rate even when the means are equal. Our results illustrate permutation testing should be confined to testing for non-identical distributions. Contact: [email protected]
منابع مشابه
A transposase strategy for creating libraries of circularly permuted proteins
A simple approach for creating libraries of circularly permuted proteins is described that is called PERMutation Using Transposase Engineering (PERMUTE). In PERMUTE, the transposase MuA is used to randomly insert a minitransposon that can function as a protein expression vector into a plasmid that contains the open reading frame (ORF) being permuted. A library of vectors that express different ...
متن کاملComparison of Permutation Methods for the Partial Correlation and Partial Mantel Tests
This study compares empirical type I error and power of different permutation techniques that can be used for partial correlation analysis involving three data vectors and for partial Mantel tests. The partial Mantel test is a form of first-order partial correlation analysis involving three distance matrices which is widely used in such fields as population genetics, ecology, anthropology, psyc...
متن کاملVirtual Global Search: Application to 9×9 Go
Monte-Carlo simulations can be used as an evaluation function for Alpha-Beta in games. If w is the width of the search tree, d its depth, and g the number of simulations at each leaf, the total number of simulations is at least g× (2× w 2 ). In games where moves permute, we propose to replace this algorithm by another algorithm that only needs g × 2 simulations for a similar number of games per...
متن کاملFast keyed hash/pseudo-random function using SIMD multiply and permute
HighwayHash is a new pseudo-random function based on AVX2 multiply and permute instructions for thorough and fast hashing. It is 3.8 times as fast as SipHash for 1 KB inputs. An open-source implementation is available under a permissive license. We discuss design choices and provide statistical analysis, speed measurements and preliminary cryptanalysis. Assuming it withstands further analysis, ...
متن کامل